Applying Multi-Armed Bandit Problem into Cache Decision Algorithm for Content Centric Networking
نویسندگان
چکیده
Among the future Internet architecture, Content Centric Networking (CCN) is one of the most promising network architectures, where Content Routers (CRs) are attached with the cache space to store the contents temporary and CRs provide the contents to users from their cache. The original caching scheme stores every arriving contents and that manner leads to the fast cache replacement. So, the popular contents are replaced with non-popular contents. Thus, we proposed a cache decision algorithm, which stores only popular contents and also prevents the replacing of popular contents with non-popular contents. We have intensively simulated the proposed mechanism in a chunk level simulator and the performance is compared with existing schemes. The simulation results show that the proposed mechanism outperforms the existing state-of-the-art schemes.
منابع مشابه
A Practical Method for Solving Contextual Bandit Problems Using Decision Trees
Many efficient algorithms with strong theoretical guarantees have been proposed for the contextual multi-armed bandit problem. However, applying these algorithms in practice can be difficult because they require domain expertise to build appropriate features and to tune their parameters. We propose a new method for the contextual bandit problem that is simple, practical, and can be applied with...
متن کاملRelative Upper Confidence Bound for the K-Armed Dueling Bandit Problem
This paper proposes a new method for the Karmed dueling bandit problem, a variation on the regular K-armed bandit problem that offers only relative feedback about pairs of arms. Our approach extends the Upper Confidence Bound algorithm to the relative setting by using estimates of the pairwise probabilities to select a promising arm and applying Upper Confidence Bound with the winner as a bench...
متن کاملBayesian and Approximate Bayesian Modeling of Human Sequential Decision-Making on the Multi-Armed Bandit Problem
In this paper we investigate human exploration/exploitation behavior in a sequential-decision making task. Previous studies have suggested that people are suboptimal at scheduling exploration, and heuristic decision strategies are better predictors of human choices than the optimal model. By incorporating more realistic assumptions about subject’s knowledge and limitations into models of belief...
متن کاملRisk-aware multi-armed bandit problem with application to portfolio selection
Sequential portfolio selection has attracted increasing interest in the machine learning and quantitative finance communities in recent years. As a mathematical framework for reinforcement learning policies, the stochastic multi-armed bandit problem addresses the primary difficulty in sequential decision-making under uncertainty, namely the exploration versus exploitation dilemma, and therefore...
متن کاملBayesian and Approximate Bayesian Modeling of Human Sequential Decision-Making on the Multi-Armed Bandit Problem
In this paper we investigate human exploration/exploitation behavior in sequential-decision making tasks. Previous studies have suggested that people are suboptimal at scheduling exploration, and heuristic decision strategies are better predictors of human choices than the optimal model. By incorporating more realistic assumptions about subject’s knowledge and limitations into models of belief ...
متن کامل